Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling

نویسندگان

  • Ulf Friedrich
  • Ralf T. Münnich
  • Sven de Vries
  • Matthias Wagner
چکیده

In stratified random sampling, minimizing the variance of a total estimate leads to the optimal allocation. However, in practice, this original method is scarcely appropriate since in many applications additional constraints have to be considered. Three optimization algorithms are presented that solve the integral allocation problem with upper and lower bounds. All three algorithms exploit the fact that the feasible region is a polymatroid and share the important feature of computing the globally optimal integral solution,which generally differs from a solution obtained by rounding. This is in contrast to recent references which, in general, treat the continuous relaxation of the optimization problem. Two algorithms are of polynomial complexity and all of them are fast enough to be applied to complex problems such as the German Census 2011 allocation problem with almost 20,000 strata. © 2015 Elsevier B.V. All rights reserved. 1. Motivation Estimation in Official Statistics, in general, is based on survey sampling methods. Hence, the inference has to be drawn with respect to the sampling design. One very important design is stratified random sampling which is widely used in practice, e.g., in the German Census 2011. The universe is split into strata which generally determine certain subgroups of interest such as regions, house size classes or business codes. In stratified random sampling, the total sample size has then to be allocated to the strata by certain conditions. A finite population U of size N is split into H disjoint strata of size Nh for h = 1, . . . ,H . Next, the total sample of size n has to be split into the stratum specific sample sizes nh which refers to the so-called allocation problem. Within all H strata simple random sampling is applied, either with or without replacement. As an allocation problem, there are several options. In many cases, the total sample size is equally distributed amongst the strata (nh = n/H; equal allocation) or proportionally to the stratum sizes (nh ∝ Nh; proportional allocation). In both cases, the allocations are non-integral and, hence, have to be rounded. In stratified sampling, a well-known unbiased estimator for the total τY of the variable of interest Y in the universe is τ̂ StrRS y = H 

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Allocation Strategies for the Dark Pool Problem

We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuousvalued allocations are allowed. We also propose a modification for the case when only integer-valued allocations are possible. We extend the previous work on this problem (Ganchev et al., 2009) to adversarial scenarios, while also improving on their results in the ii...

متن کامل

Stratified Median Ranked Set Sampling: Optimum and Proportional Allocations

In this paper, for the Stratified Median Ranked Set Sampling (SMRSS), proposed by Ibrahim et al. (2010), we examine the proportional and optimum sample allocations that are two well-known methods for sample allocation in stratified sampling. We show that the variances of the mean estimators of a symmetric population in SMRSS using optimum and proportional allocations to strata are smaller than ...

متن کامل

Separable convex optimization with nested lower and upper constraints

We study a convex resource allocation problem in which lower and upper bounds are imposed on partial sums of allocations. This model is linked to a large range of applications, including production planning, speed optimization, stratified sampling, support vector machines, portfolio management, and telecommunications. We propose an efficient gradient-free divide-and-conquer algorithm, which use...

متن کامل

Sample approximation technique for mixed-integer stochastic programming problems with expected value constraints

This paper deals with the theory of sample approximation techniques applied to stochastic programming problems with expected value constraints. We extend the results of Branda (2012C) and Wang and Ahmed (2008) on the rates of convergence to the problems with a mixed-integer bounded set of feasible solutions and several expected value constraints. Moreover, we enable non-iid sampling and conside...

متن کامل

THE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS

Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 92  شماره 

صفحات  -

تاریخ انتشار 2015